Inexact Block Quasi - Newton Methods for Sparsesystems of Nonlinear Equations
نویسنده
چکیده
In this paper we present the results obtained in solving consistent sparse systems of n nonlinear equations F(x) = 0; by a Quasi-Newton method combined with a p block iterative row-projection linear solver of Cimmino-type, 1 p n: Under weak regularity conditions for F; it is proved that this Inexact Quasi-Newton method has a local, linear convergence in the energy norm induced by the preconditioned matrix HA; where A is an initial guess of the Jacobian matrix, and it may converge superlinearly too. of the Jacobian matrix was used for solving a set of nonlinear test problems with sizes ranging from 1024 to 131072 on the CRAY T3E under the MPI environment.
منابع مشابه
Inexact Quasi-Newton methods for sparse systems of nonlinear equations
In this paper we present the results obtained in solving consistent sparse systems of n nonlinear equations F (x) = 0; by a Quasi-Newton method combined with a p block iterative row-projection linear solver of Cimmino-type, 1 p n: Under weak regularity conditions for F; it is proved that this Inexact Quasi-Newton method has a local, linear convergence in the energy norm induced by the precondit...
متن کاملParallel Newton Methods for Sparse Systems of Nonlinear Equations
In this paper we give the results found in solving consistent sparse systems of nonlinear equations by an inexact Newton and Quasi-Newton method both combined with a block iterative row-projection linear solver of Cimmino-type. A simple partitioning of the Jacobian matrix was used for solving two nonlinear test problems, that is a tridiagonal problem of size n = 131072 and a nonlinear Poisson p...
متن کاملInexact Newton Methods and Mixed Nonlinear Complementary Problems
In this paper we present the results obtained in the solution of sparse and large systems of nonlinear equations by Inexact Newton-like methods [6]. The linearized systems are solved with two preconditioners particularly suited for parallel computation. We report the results for the solution of some nonlinear problems on the CRAY T3E under the MPI environment. Our methods may be used to solve m...
متن کاملInexact Simplified Newton Iterations for Implicit Runge-Kutta Methods
We consider possibly stiff and implicit systems of ordinary differential equations (ODEs). The major difficulty and computational bottleneck in the implementation of fully implicit Runge–Kutta (IRK) methods resides in the numerical solution of the resulting systems of nonlinear equations. To solve those systems we show that the use of inexact simplified Newton methods is efficient. Linear syste...
متن کاملA globally convergent Inexact-Newton method for solving reducible nonlinear systems of equations
A nonlinear system of equations is said to be reducible if it can be divided into m blocks (m > 1) in such a way that the i−th block depends only on the first i blocks of unknowns. Different ways of handling the different blocks with the aim of solving the system have been proposed in the literature. When the dimension of the blocks is very large, it can be difficult to solve the linear Newtoni...
متن کامل